Optimizing Centralized Dispatching of Flexible Feeder Transit considering Transfer Coordination with Regular Public Transit

Improved Public Transit Improved Public Transit

Public Transit Labeling

We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approaches either require massive preprocessing effort or provide limited speedups. Leveraging recent advances in Hub Labeling, the fastest algorithm for road networks, we revisit the well-known time-expanded model for publi...

Public Transit Network Hierarchy Based on Residential Transit Trip Distance

To the problem of being lack of transit network hierarchy theory, a research on public transit network hierarchy optimization based on residential transit trip distance is conducted. Firstly, the hierarchy standard of transit network is given, in addition, both simulating electron cloud model and Rayleigh distribution model are used to fit the residential transit trip distance. Secondly, from t...

Partitioning of Public Transit Networks

Partitioning of public transit networks is a useful approach to speed up the query times or the preprocessing phase of public transit routing algorithms. The aim of partitioning of public transit networks is to find small partitions of the stations of a given network such that most of the traffic lies in their inside while only little traffic goes between them. To find such partitions of the pu...

Public Transit Routing with Unrestricted Walking

We study the problem of answering profile queries in public transportation networks that allow unrestricted walking. That is, finding all Pareto-optimal journeys regarding travel time and number of transfers in a given time interval. We introduce a novel algorithm that, unlike most state-of-the-art algorithms, can compute profiles efficiently in a setting that allows arbitrary walking. Using ou...